- 公用子序列
- common: adj. 1.共通的，共同的，共有的。 2.公眾的；公共 ...
- subsequence: n. 接續(xù)；緊隨…之后；隨后發(fā)生的事情；后果。
- longest common subsequence: 最大共同子序列
- infinite subsequence: 無窮子序列
- subsequence counter: 子序列計數(shù)器微指令計數(shù)器
下載手機(jī)詞典可隨時隨地查詞查翻譯
common subsequence中文什么意思
- 公用子序列
下載手機(jī)詞典可隨時隨地查詞查翻譯
例句與用法
- The first part of the present paper is preliminaries . at the second part we show a lemma as follows : supposing s1 , s2 , . . . are strictly increasing sequences , then there exists a strictly increasing sequence t such that for any i , si and t contain a common subsequence having upper density 1 in t . using the lemma we give a chaotic form more rigorous than distribution chaos in a sequence
本文第一部分介紹有關(guān)的預(yù)備知識；第二部分首先證明了一個關(guān)鍵性引理：對于給定的可數(shù)(包括有限)個嚴(yán)格遞增的正整數(shù)序列s _ 1 ， s _ 2 ， … ，可以找到某一個嚴(yán)格遞增的正整數(shù)序列t ，使得對于每一個i = 1 ， 2 ， … ，序列s _ i與序列t有一個共同的子序列，它在序列t中的上密度為1 。 - Finally , the ability of applying the approved aco algorithm to msa is studied . the idea of divide - and - conquer is adopted to improving the progressive algorithm and the longest common subsequence of multiple sequences is proposed as the partition points of multiple sequences . also , the paper presents how to solve the longest common subsequence of multiple sequences by the approved aco algorithm for mcp
最后,本文對改進(jìn)的蟻群優(yōu)化算法在多序列比對問題上的應(yīng)用進(jìn)行了研究,采取分治思想改進(jìn)現(xiàn)有的progressive算法,提出利用最長公共子序列進(jìn)行多序列分割的策略,并給出怎樣利用解決最大團(tuán)問題的蟻群優(yōu)化算法求解多序列的最長公共子序列的方法。